Dynamic Online Routing Algorithm for MPLS Traffic Engineering
نویسندگان
چکیده
The main contribution of this paper is a new online routing algorithm, called Dynamic Online Routing Algorithm (DORA), for dynamic setup of bandwidth guaranteed paths in MPLS networks. The goal of DORA is to accept as many network path setup requests as possible by carefully mapping paths with reserved bandwidth evenly across the network. The key operation behind DORA is to avoid routing over links that: 1) have high potential to be part of any other paths, and 2) have less residual bandwidth available. We compare DORA against other existing constraint-based routing algorithms based on two performance metrics: path setup rejection ratio and percentage of successful reroutes. Our result shows that DORA performs better than the other algorithms in both metrics.
منابع مشابه
Survivable Online Routing for MPLS Traffic Engineering
Traffic engineering capabilities defined in MPLS enables QoS online routing of LSPs. In this paper we address issues of network survivability in online routing. We define a new link weight LFL (Lost Flow in Link) that can be applied for dynamic routing of LSPs in survivable MPLS network. We propose to use the LFL metric as a “scaling factor” for existing dynamic routing algorithms that make use...
متن کاملUsing a Fuzzy Rule-based Algorithm to Improve Routing in MPLS Networks
Today, the use of wireless and intelligent networks are widely used in many fields such as information technology and networking. There are several types of these networks that MPLS networks are one of these types. However, in MPLS networks there are issues and problems in the design and implementation discussion, for example security, throughput, losses, power consumption and so on. Basically,...
متن کاملAn Efficient Virtual Topology Design and Traffic Engineering Scheme for IP/WDM Networks
We propose an online traffic engineering (TE) scheme for efficient routing of bandwidth guaranteed connections on a Multiprotocol label switching (MPLS)/wavelength division multiplexing (WDM) network with a traffic pattern varying with the time of day. We first consider the problem of designing the WDM virtual topology utilizing multi-hour statistical traffic pattern. After presenting an effect...
متن کاملA New Precomputation Scheme for MPLS Traffic Engineering Routing
This paper presents a new precomputation algorithm for Multi Protocol Label Switching (MPLS) traffic engineering routing. The prior MPLS routing algorithms try to minimize the interference between different sourcedestination pairs by circumventing the critical links. But the process of identifying critical links is very computationally expensive. The main contribution of this paper is a new pre...
متن کاملA case study on evaluating the benefits of MPLS traffic engineering through constraint-based routing and network controls
In this paper, we attempt to understand the benefits of MPLS traffic engineering through a case study. Specifically, we do a comparative study of MPLS traffic engineering in the presence of dynamic constraint-based routing compared to destination-based routing. For this case study, we use a model derived from an actual service provider network. Different control schemes that can be deployable f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002